Leray Numbers of Projections and a Topological Helly Type Theorem

نویسندگان

  • Gil Kalai
  • Roy Meshulam
چکیده

Let X be a simplicial complex on the vertex set V . The rational Leray number L(X) of X is the minimal d such that H̃i(Y ;Q) = 0 for all induced subcomplexes Y ⊂ X and i ≥ d. Suppose V = ⋃m i=1 Vi is a partition of V such that the induced subcomplexes X[Vi] are all 0-dimensional. Let π denote the projection of X into the (m − 1)-simplex on the vertex set {1, . . . ,m} given by π(v) = i if v ∈ Vi. Let r = max{|π−1(π(x))| : x ∈ |X|}. It is shown that L(π(X)) ≤ rL(X) + r − 1 . One consequence is a topological extension of a Helly type result of Amenta. Let F be a family of compact sets in Rd such that for any F ′ ⊂ F , the intersection ⋂ F ′ is either empty or contractible. It is shown that if G is a family of sets such that for any finite G′ ⊂ G, the intersection ⋂ G′ is a union of at most r disjoint sets in F , then the Helly number of G is at most r(d+ 1). Math Subject Classification. 55U10, 52A35

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Helly numbers of acyclic families

The Helly number of a family of sets with empty intersection is the size of its largest inclusionwise minimal sub-family with empty intersection. Let F be a finite family of open subsets of an arbitrary locally arc-wise connected topological space Γ. Assume that for every sub-family G ⊆ F the intersection of the elements of G has at most r connected components, each of which is a Q-homology cel...

متن کامل

Bounding Helly Numbers via Betti Numbers

We show that very weak topological assumptions are enough to ensure the existence of a Hellytype theorem. More precisely, we show that for any non-negative integers b and d there exists an integer h(b, d) such that the following holds. If F is a finite family of subsets of R such that β̃i ( ⋂G) ≤ b for any G ( F and every 0 ≤ i ≤ dd/2e−1 then F has Helly number at most h(b, d). Here β̃i denotes t...

متن کامل

On the gap between representability and collapsibility

A simplicial complex K is called d-representable if it is the nerve of a collection of convex sets in R; K is d-collapsible if it can be reduced to an empty complex by repeatedly removing a face of dimension at most d − 1 that is contained in a unique maximal face; and K is d-Leray if every induced subcomplex of K has vanishing homology of dimension d and larger. It is known that d-representabl...

متن کامل

The Colorful Helly Theorem and Colorful Resolutions of Ideals

We demonstrate that the topological Helly theorem and the algebraic Auslander-Buchsbaum may be viewed as different versions of the same phenomenon. Using this correspondence we show how the colorful Helly theorem of I.Barany and its generalizations by G.Kalai and R.Meshulam translates to the algebraic side. Our main results are algebraic generalizations of these translations, which in particula...

متن کامل

A Simple Proof of the Sion Minimax Theorem

For convex subsets X of a topological vector space E, we show that a KKM principle implies a Fan-Browder type fixed point theorem and that this theorem implies generalized forms of the Sion minimax theorem. The von Neumann-Sion minimax theorem is fundamental in convex analysis and in game theory. von Neumann [8] proved his theorem for simplexes by reducing the problem to the 1-dimensional cases...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007